﻿using System;

namespace ProblemsSet
{
    public class Problem_18 : BaseProblem
    {
        public override object GetResult()
        {
            var val = new[]
                          {
                                new[]{75},
                                new[]{95, 64},
                                new[]{17, 47, 82},
                                new[]{18, 35, 87, 10},
                                new[]{20, 04, 82, 47, 65},
                                new[]{19, 01, 23, 75, 03, 34},
                                new[]{88, 02, 77, 73, 07, 63, 67},
                                new[]{99, 65, 04, 28, 06, 16, 70, 92},
                                new[]{41, 41, 26, 56, 83, 40, 80, 70, 33},
                                new[]{41, 48, 72, 33, 47, 32, 37, 16, 94, 29},
                                new[]{53, 71, 44, 65, 25, 43, 91, 52, 97, 51, 14},
                                new[]{70, 11, 33, 28, 77, 73, 17, 78, 39, 68, 17, 57},
                                new[]{91, 71, 52, 38, 17, 14, 91, 43, 58, 50, 27, 29, 48},
                                new[]{63, 66, 04, 68, 89, 53, 67, 30, 73, 16, 69, 87, 40, 31},
                                new[]{04, 62, 98, 27, 23, 09, 70, 98, 73, 93, 38, 53, 60, 04, 23}
                          };

            return GetMaxPath(ref val);
        }

        public static long GetMaxPath(ref int[][] values)
        {
            var res = new int[values.Length][];
            var max = 0;
            for (var i = 0; i < values.Length; i++)
            {
                res[i] = new int[values[i].Length];
                for (var j = 0; j < values[i].Length; j++)
                {
                    if (i==0)
                    {
                        res[i][j] = values[i][j];
                        if (max < res[i][j]) max = res[i][j];
                        continue;
                    }
                    if (j == 0)
                    {
                        res[i][j] = res[i - 1][j] + values[i][j];
                        if (max < res[i][j]) max = res[i][j];
                        continue;
                    }
                    if (j == values[i].Length-1)
                    {
                        res[i][j] = res[i - 1][j-1] + values[i][j];
                        if (max < res[i][j]) max = res[i][j];
                        continue;
                    }
                    res[i][j] = Math.Max(res[i - 1][j - 1], res[i - 1][j]) + values[i][j];
                    if (max < res[i][j]) max = res[i][j];
                }
            }
            return max;
        }



        public override string Problem
        {
            get
            {
                return @"By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.

3
7 4
2 4 6
8 5 9 3

That is, 3 + 7 + 4 + 9 = 23.

Find the maximum total from top to bottom of the triangle below:

75
95 64
17 47 82
18 35 87 10
20 04 82 47 65
19 01 23 75 03 34
88 02 77 73 07 63 67
99 65 04 28 06 16 70 92
41 41 26 56 83 40 80 70 33
41 48 72 33 47 32 37 16 94 29
53 71 44 65 25 43 91 52 97 51 14
70 11 33 28 77 73 17 78 39 68 17 57
91 71 52 38 17 14 91 43 58 50 27 29 48
63 66 04 68 89 53 67 30 73 16 69 87 40 31
04 62 98 27 23 09 70 98 73 93 38 53 60 04 23

NOTE: As there are only 16384 routes, it is possible to solve this problem by trying every route. However, Problem 67, is the same challenge with a triangle containing one-hundred rows; it cannot be solved by brute force, and requires a clever method! ;o)";
            }
        }

        public override bool IsSolved
        {
            get
            {
                return true;
            }
        }

        public override object Answer
        {
            get
            {
                return 1074;
            }
        }

    }
}
